#include "avl_tree.h"

//#include <iostream>
//using std::cout;
//using std::endl;

int main(){
	AVLTree<int,true> t;
	cout << endl;
	cout << "rank 1: " << t.rank(1) << endl;
	cout << "rank 2: " << t.rank(2) << endl;
	cout << "rank 5: " << t.rank(5) << endl;
	cout << "rank 10: " << t.rank(10) << endl;
	cout << "rank 11: " << t.rank(11) << endl;
	cout << "rank 19: " << t.rank(19) << endl;
	cout << "rank 20: " << t.rank(20) << endl;
	cout << "rank 100: " << t.rank(100) << endl;
	cout << endl << "in: " << endl;
	t.in_order();
	return 0;
}


